home *** CD-ROM | disk | FTP | other *** search
/ Aminet 5 / Aminet 5 - March 1995.iso / Aminet / dev / misc / LEDA_gene.lha / LEDA-3.1c-generic / man / Tables.tex < prev    next >
Encoding:
Text File  |  1994-08-05  |  6.2 KB  |  100 lines
  1. {\magtwo 10. Tables }
  2.  
  3. {\magonebf 10.1 Data Types}
  4. \bigskip
  5. \halign {
  6. #\quad\hfil&#\quad\hfil&#\quad\hfil&#\quad\hfil&\hfil#\cr
  7. {\bf Name}          &{\bf Item}      &{\bf Header}      &{\bf Library}  &{\bf Page}\cr
  8. \noalign{\smallskip}
  9. array               &------          &array.h           &libL.a         &21\cr
  10. array2              &------          &array.h           &libL.a         &23\cr
  11. b\_priority\_queue  &b\_pq\_item     &b\_prio.h         &libL.a         &41\cr
  12. b\_queue            &------          &b\_queue.h        &libL.a         &27\cr
  13. b\_stack            &------          &b\_stack.h        &libL.a         &26\cr
  14. bool                &------          &basic.h           &libL.a         &15\cr
  15. circle              &------          &plane.h           &libP.a         &85\cr
  16. cmd\_istream        &------          &stream.h          &libL.a         &110\cr
  17. cmd\_ostream        &------          &stream.h          &libL.a         &110\cr
  18. d2\_dictionary      &d2\_dic\_item   &d2\_dictionary.h  &libP.a         &88\cr
  19. d\_array            &------          &d\_array.h        &libL.a         &44\cr
  20. dictionary          &dic\_item       &dictionary.h      &libL.a         &42\cr
  21. edge\_array         &------          &graph.h           &libG.a         &65\cr
  22. edge\_set           &------          &edge\_set.h       &libG.a         &68\cr
  23. file\_istream       &------          &stream.h          &libL.a         &109\cr
  24. file\_ostream       &------          &stream.h          &libL.a         &109\cr
  25. graph               &node/edge       &graph.h           &libG.a         &53\cr
  26. GRAPH               &node/edge       &graph.h           &libG.a         &61\cr
  27. h\_array            &------          &h\_array.h        &libL.a         &46\cr
  28. int\_set            &------          &int\_set.h        &libL.a         &34\cr
  29. interval\_set       &is\_item        &interval\_set.h   &libP.a         &92\cr
  30. line                &------          &plane.h           &libP.a         &82\cr
  31. list                &list\_item      &list.h            &libL.a         &28\cr
  32. matrix              &------          &matrix.h          &libL.a         &19\cr
  33. node\_array         &------          &graph.h           &libG.a         &65\cr
  34. node\_matrix        &------          &graph.h           &libG.a         &67\cr
  35. node\_partition     &------          &node\_partition.h &libG.a         &69\cr
  36. node\_pq            &------          &node\_pq.h        &libG.a         &70\cr
  37. node\_set           &------          &node\_set.h       &libG.a         &68\cr
  38. panel               &------          &window.h          &libP.a/libWx.a &106\cr
  39. partition           &partition\_item &partition.h       &libL.a         &35\cr
  40. planar\_map         &node/edge/face  &planar\_map.h     &libG.a         &59\cr
  41. point               &------          &plane.h           &libP.a         &79\cr
  42. point\_set          &ps\_item        &point\_set.h      &libP.a         &90\cr
  43. polygon             &------          &plane.h           &libP.a         &84\cr
  44. priority\_queue     &pq\_item        &prio.h            &libP.a         &39\cr
  45. p\_dictionary       &p\_dic\_item    &p\_dictionary.h   &libL.a         &50\cr
  46. PLANAR\_MAP         &node/edge/face  &planar\_map.h     &libG.a         &64\cr
  47. queue               &------          &queue.h           &libL.a         &25\cr
  48. segment             &------          &plane.h           &libP.a         &80\cr
  49. segment\_set        &seg\_item       &segment\_set.h    &libP.a         &94\cr
  50. set                 &------          &set.h             &libL.a         &33\cr
  51. sortseq             &seq\_item       &sortseq.h         &libL.a         &47\cr
  52. stack               &------          &stack.h           &libL.a         &24\cr
  53. string              &------          &basic.h           &libL.a         &15\cr
  54. string\_istream     &------          &stream.h          &libL.a         &111\cr
  55. string\_ostream     &------          &stream.h          &libL.a         &111\cr
  56. subdivision         &node/face       &subdivision.h     &libP.a         &96\cr
  57. tree\_collection    &d\_vertex       &tree\_collection.h&libL.a         &36\cr
  58. ugraph              &node/edge       &ugraph.h          &libG.a         &57\cr
  59. UGRAPH              &node/edge       &ugraph.h          &libG.a         &63\cr
  60. vector              &------          &vector.h          &libL.a         &17\cr
  61. window              &------          &window.h          &libP.a/libWx.a &97\cr
  62. }
  63.  
  64. \vfill\eject
  65.  
  66. \bigskip
  67. {\magonebf 10.2 Algorithms}
  68. \bigskip
  69. \halign {
  70. #\quad\hfil&#\quad\hfil&#\quad\hfil&\hfil#\cr
  71. {\bf Name}                     &{\bf Header}      &{\bf Library}  &{\bf Page}\cr
  72. \noalign{\smallskip}
  73. ALL\_PAIRS\_SHORTEST\_PATHS       &graph\_alg.h   &libG.a           &73\cr
  74. BELLMAN\_FORD                     &graph\_alg.h   &libG.a           &73\cr
  75. BFS                               &graph\_alg.h   &libG.a           &72\cr
  76. COMPONENTS                        &graph\_alg.h   &libG.a           &72\cr
  77. CONVEX\_HULL                      &plane\_alg.h   &libP.a           &87\cr
  78. DFS                               &graph\_alg.h   &libG.a           &71\cr
  79. DFS\_NUM                          &graph\_alg.h   &libG.a           &71\cr
  80. DIJKSTRA                          &graph\_alg.h   &libG.a           &73\cr
  81. MAX\_CARD\_MATCHING               &graph\_alg.h   &libG.a           &74\cr
  82. MAX\_CARD\_BIPARTITE\_MATCHING    &graph\_alg.h   &libG.a           &74\cr
  83. MAX\_FLOW                         &graph\_alg.h   &libG.a           &74\cr
  84. MAX\_WEIGHT\_BIPARTITE\_MATCHING  &graph\_alg.h   &libG.a           &75\cr
  85. MIN\_SPANNING\_TREE               &graph\_alg.h   &libG.a           &75\cr
  86. PLANAR                            &graph\_alg.h   &libG.a           &76\cr
  87. SEGMENT\_INTERSECTION             &plane\_alg.h   &libP.a           &87\cr
  88. SPANNING\_TREE                    &graph\_alg.h   &libG.a           &75\cr
  89. STRAIGHT\_LINE\_EMBEDDING         &graph\_alg.h   &libG.a           &76\cr
  90. STRONG\_COMPONENTS                &graph\_alg.h   &libG.a           &72\cr
  91. TOPSORT                           &graph\_alg.h   &libG.a           &71\cr
  92. TRANSITIVE\_CLOSURE               &graph\_alg.h   &libG.a           &72\cr
  93. TRIANGULATE\_PLANAR\_MAP          &graph\_alg.h   &libG.a           &76\cr
  94. VORONOI                           &plane\_alg.h   &libP.a           &87\cr
  95. }
  96. \vfill\eject
  97.  
  98. \vglue 10cm
  99. \vfill\eject
  100.